Node Polynomials for Curves on Surfaces
نویسندگان
چکیده
We complete the proof of a theorem we announced and partly proved in [Math. Nachr. 271 (2004), 69-90, math.AG/0111299]. The concerns family curves on surfaces. It has two parts. first was that paper. describes natural cycle enumerates with precisely $r$ ordinary nodes. second part is here. asserts that, for $r\le 8$, class this given by computable universal polynomial pushdowns to parameter space products Chern classes family.
منابع مشابه
Computing Node Polynomials for Plane Curves
According to the Göttsche conjecture (now a theorem), the degree N of the Severi variety of plane curves of degree d with δ nodes is given by a polynomial in d, provided d is large enough. These “node polynomials” Nδ(d) were determined by Vainsencher and Kleiman–Piene for δ ≤ 6 and δ ≤ 8, respectively. Building on ideas of Fomin and Mikhalkin, we develop an explicit algorithm for computing all ...
متن کاملRelative node polynomials for plane curves
We generalize the recent work of S. Fomin and G. Mikhalkin on polynomial formulas for Severi degrees. The degree of the Severi variety of plane curves of degree d and δ nodes is given by a polynomial in d , provided δ is fixed and d is large enough. We extend this result to generalized Severi varieties parametrizing plane curves that, in addition, satisfy tangency conditions of given orders wit...
متن کاملBezier curves and surfaces based on modified Bernstein polynomials
. Parametric curves are represented using these modified Bernstein basis and the concept of total positivity is applied to investigate the shape properties of the curve. We get Bézier curve defined on [0, 1] when we set the parameter α, β to the value 0. We also present a de Casteljau algorithm to compute Bernstein Bézier curves and surfaces with shifted knots. The new curves have some properti...
متن کاملFitting Curves and Surfaces With Constrained Implicit Polynomials
A problem which often arises while fitting implicit polynomials to 2D and 3D data sets is the following: Although the data set is simple, the fit exhibits undesired phenomena, such as loops, holes, extraneous components, etc. Previous work tackled these problems by optimizing heuristic cost functions, which penalize some of these topological problems in the fit. This paper suggests a different ...
متن کاملTransforming Curves on Surfaces
We describe an optimal algorithm to decide if one closed curve on a triangulated 2-manifold can be continuously transformed to another, i.e., if they are homotopic. Suppose C 1 and C 2 are two closed curves on a surface M of genus g. Further, suppose T is a triangulation of M of size n such that C 1 and C 2 are represented as edge-vertex sequences of lengths k 1 and k 2 in T , respectively. The...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Symmetry Integrability and Geometry-methods and Applications
سال: 2022
ISSN: ['1815-0659']
DOI: https://doi.org/10.3842/sigma.2022.059